A post-optimization method to route scheduled lightpath demands with multiplicity

نویسندگان

  • Lucile Belgacem
  • Irène Charon
  • Olivier Hudry
چکیده

We consider a NP-hard problem related to the routing and wavelength assignment (RWA) problem in optical networks, dealing with scheduled lightpath demands (SLDs) with multiplicity. A SLD is a connection demand between two nodes of the network, during a certain time. Each SLD requires a given number of wavelengths (its multiplicity). Given a set of SLDs, we want to assign a lightpath (i.e. a routing path and the necessary wavelengths) to each SLD, so that the total number of required wavelengths is minimized. To solve the problem, we design a postoptimization method allowing to improve the solutions provided by a heuristic. Experimental results show that this post-optimization method is quite efficient to reduce the number of necessary wavelengths.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Routing and wavelength assignment of scheduled lightpath demands

In this paper, we present algorithms that compute the routing and wavelength assignment (RWA) for scheduled lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality. Scheduled lightpath demands are connection demands for which the setup and teardown times are known in advance. We formulate separately the routing problem and the wavelength assignment p...

متن کامل

Optimal routing of Scheduled Lightpath Demands in an optical transport network using a Branch & Bound algorithm Routage optimal de demandes de chemins optiques planifiés dans un réseau de transport optique maillé

In this paper we investigate the problem of routing Scheduled Lightpath Demands (SLDs) in an optical transport network. SLDs are connection demands for which the set-up and tear-down dates are known in advance. In some cases, a set of SLDs may contain demands that are not simultaneous in time; it is thus possible to use a same network resource (e.g., a channel) to satisfy time-disjoint demands....

متن کامل

Strategies for the Routing and Wavelength Assignment of Scheduled and Random Lightpath Demands

We propose three routing strategies for the routing and wavelength assignment (RWA) of scheduled and random lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality. Scheduled lightpath demands (SLDs) are connection demands for which the set-up and tear-down times are known in advance as opposed to random lightpath demands (RLDs) which are dynamically...

متن کامل

Routing and Wavelength Assignment of Scheduled Lightpath Demands in a WDM Optical Transport Network

We present RWA algorithms for a new class of traffic model where, besides the source, destination and size (number of lightpaths) of the traffic demands, their set-up and tear-down dates are known. They are called Scheduled Lightpath Demands (SLDs). We model the RWA problem as a spatio-temporal combinatorial optimization problem and provide two solution algorithms. The time disjointness that co...

متن کامل

On RWA Algorithms for Scheduled Lightpath Demands in Wavelength Division Multiplexing Networks

We have proposed and evaluated a novel heuristic algorithm of routing and wavelength assignment (RWA) for scheduled lightpath demands (SLD). Our algorithm works on directed and undirected optical networks, and is shown here to have a performance gain in terms of the number of wavelengths upto 65.8 % compared with the most recently introduced method, TDP_RWA. Also, we show the execution time of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2010